Min cut is NP-complete for edge weighted trees
نویسندگان
چکیده
منابع مشابه
Min Cut is NP-Complete for Edge Weigthed Trees
We show that the Min Cut Linear Arrangement Problem (Min Cut) is NP-complete for trees with polynomial size edge weights and derive from this the NP-completeness of Min Cut for planar graphs with maximum vertex degree 3. This is used to show the NP-completeness of Search Number, Vertex Separation, Progressive Black/ White Pebble Demand, and Topological Bandwidth for planar graphs with maximum v...
متن کاملPathwidth is NP-Hard for Weighted Trees
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for particular subclasses of chordal graphs, and we deduce that the problem remains hard for weighted trees. We also discuss subclasses of chordal graphs for which the problem is polynomial.
متن کاملMaximizing edge-ratio is NP-complete
Given a graph G and a bipartition of its vertices, the edge-ratio is the minimum for both classes so defined of their number of internal edges divided by their number of cut edges. We prove that maximizing edgeratio is NP-complete.
متن کاملDistance-2 Edge Coloring is NP-Complete
Let G be a simple, undirected graph. We say that two edges of G are within distance 2 of each other if either they are adjacent or there is some other edge that is adjacent to both of them. A distance-2-edge-coloring of G is an assignment of colors to edges so that any two edges within distance 2 of each other have distinct colors, or equivalently, a vertex-coloring of the square of the line gr...
متن کاملRecognizing Union-Find trees is NP-complete
Disjoint-Set forests, consisting of Union-Find trees are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a characterization exists for Union trees which are constructed without using path compression). In this paper we provide such a characterization and show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1988
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90028-x